Optimal Online Algorithms on Two Hierarchical Machines with Resource Augmentation
نویسندگان
چکیده
This paper investigates an online hierarchical scheduling problem with resource augmentation, i.e., the resources of the online algorithms are different from those of the offline algorithms. The machines are provided with different capacity according to their hierarchies. One with the hierarchy 1 has a speed of s (q) in the online (offline) algorithms and can process all the jobs. The other with hierarchy 2 has a speed of 1 in the online/offline algorithms and can only process partial jobs. The objective is to minimize makespan. For any 0 < q, s < ∞, we present optimal online algorithms with parametric competitive ratios.
منابع مشابه
New Results on Flow Time with Resource Augmentation
We study the problem of scheduling n jobs that arrive over time. We consider a non-preemptive setting on a single machine. The goal is to minimize the total flow time. We use extra resource competitive analysis: an optimal off-line algorithm which schedules jobs on a single machine is compared to a more powerful on-line algorithm that has l machines. We design an algorithm of competitive ratio ...
متن کاملWeighted Flowtime on Capacitated Machines
It is well-known that SRPT is optimal for minimizing flow time on machines that run one job at a time. However, running one job at a time is a big underutilization for modern systems where sharing, simultaneous execution, and virtualization-enabled consolidation are a common trend to boost utilization. Such machines, used in modern large data centers and clouds, are powerful enough to run multi...
متن کاملOptimal Online Flow Time with Resource Augmentation
We study the problem of scheduling n jobs that arrive over time. We consider a nonpreemptive setting on a single machine. The goal is to minimize the total flow time. We use extra resource competitive analysis: an optimal off-line algorithm which schedules jobs on a single machine is compared to a more powerful on-line algorithm that has ` machines. We design an algorithm of competitive ratio O...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملOnline Distributed Scheduling on a Fault-prone Parallel System
We consider a parallel system of m identical machines prone to unpredictable crashes and restarts, trying to cope with the continuous arrival of tasks to be executed. Tasks have different computational requirements (i.e., processing time or size). The flow of tasks, their size, and the crash and restart of the machines are assumed to be controlled by an adversary. Then, we focus on the study of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Math., Alg. and Appl.
دوره 4 شماره
صفحات -
تاریخ انتشار 2011